Remarks on bootstrap percolation in metric networksTLUSTY, T; ECKMANN, J.-P.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 20, issn 1751-8113, 205004.1-205004.11Article

Exterior-interior duality for discrete graphsSMILANSKY, Uzy.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 3, issn 1751-8113, 035101.1-035101.13Article

Factors of locally almost regular graphsJOENTGEN, A; VOLKMANN, L.Bulletin of the London Mathematical Society. 1991, Vol 23, pp 121-122, issn 0024-6093, 2Article

ARITHMETICAL RANK OF TORIC IDEALS ASSOCIATED TO GRAPHSKATSABEKIS, Anargyros.Proceedings of the American Mathematical Society. 2010, Vol 138, Num 9, pp 3111-3123, issn 0002-9939, 13 p.Article

Isospectral drums in R², involution graphs and Euclidean TI-domainsTHAS, Koen.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 26, pp 7233-7237, issn 1751-8113, 5 p.Article

Indécomposabilité et irréductibilité dans la variété des rétractes absolues de graphes réflexifs = Indecomposability and irreductibility in the variety of absolute retracts of reflexive graphsMUSTAPHA KABIL; POUZET, M.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 4, pp 499-504, issn 0764-4442Article

Embedding finite graphs into graphs colored with infinitely many colorsHAJNAL, A.Israel Journal of Mathematics. 1991, Vol 73, Num 3, pp 309-319, issn 0021-2172Article

The problem of deficiency indices for discrete Schrodinger operators on locally finite graphsGOLENIA, Sylvain; SCHUMACHER, Christoph.Journal of mathematical physics. 2011, Vol 52, Num 6, issn 0022-2488, 063512.1-063512.17Article

Percolation on finite Cayley graphsMALON, Christopher; PAK, Igor.Lecture notes in computer science. 2002, pp 91-104, issn 0302-9743, isbn 3-540-44147-6, 14 p.Conference Paper

A short proof of Fleischner's theoremGEORGAKOPOULOS, Agelos.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6632-6634, issn 0012-365X, 3 p.Article

Random walks on graphs: ideas, techniques and resultsBURIONI, R; CASSI, D.Journal of physics. A, mathematical and general. 2005, Vol 38, Num 8, pp R45-R78, issn 0305-4470Article

Narrowing the narrowing spaceANTOY, S; ARIOLA, Z. M.Lecture notes in computer science. 1997, pp 1-15, issn 0302-9743, isbn 3-540-63398-7Conference Paper

Binding numbers and f-factors of graphsKANO, M; TOKUSHIGE, N.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 213-221, issn 0095-8956Article

The bounded chromatic number for graphs of genus gBERMAN, K. A; PAUL, J. L.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 183-196, issn 0095-8956Article

The double reconstruction conjecture about finite colored hypergraphsHASHIGUCHI, K.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 1, pp 64-76, issn 0095-8956Article

The Ramsey property for families of graphs which exclude a given graphRÖDL, V; SAUER, N.Canadian journal of mathematics. 1992, Vol 44, Num 5, pp 1050-1060, issn 0008-414XArticle

A mixed version of menger's theoremEGAWA, Y; KANEKO, A; MATSUMOTO, M et al.Combinatorica (Print). 1991, Vol 11, Num 1, pp 71-74, issn 0209-9683Article

A disproof of Henning's conjecture on irredundance perfect graphsVOLKMANN, Lutz; ZVEROVICH, Vadim E.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 539-554, issn 0012-365XArticle

On separable self-complementary graphsKAWARABAYASHI, Ken-Ichi; NAKAMOTO, Atsuhiro; ODA, Yoshiaki et al.Discrete mathematics. 2002, Vol 257, Num 1, pp 165-168, issn 0012-365X, 4 p.Article

Computational complexity of Ehrenfeucht-Fraïssé games on finite structuresPEZZOLI, E.Lecture notes in computer science. 1999, pp 159-170, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Almost rank three graphsGARDINER, A.Discrete mathematics. 1992, Vol 103, Num 3, pp 253-257, issn 0012-365XArticle

Umbral interpolation and the addition/contraction tree for graphsRAY, N; WRIGHT, C.Discrete mathematics. 1992, Vol 103, Num 1, pp 67-74, issn 0012-365XArticle

A structure to decide reachability in Petri nets = A structure to... Petri netsLAMBERT, J. L.Theoretical computer science. 1992, Vol 99, Num 1, pp 79-104, issn 0304-3975Article

Cataloging graphs by generating them uniformly at randomKERBER, A; LAUE, R; HAGER, R et al.Journal of graph theory. 1990, Vol 14, Num 5, pp 559-563, issn 0364-9024Article

Induced subgraphs and well-quasi-orderingDAMASCHKE, P.Journal of graph theory. 1990, Vol 14, Num 4, pp 427-435, issn 0364-9024Article